Dyn-FO: A Parallel, Dynamic Complexity Class
نویسندگان
چکیده
منابع مشابه
Descriptive Complexity: A Logicians Approach to Computation
structures, North Holland, 1974. [19] S. Patnaik and N. Immerman, Dyn-FO: A parallel, dynamic complexity class, ACM Symp. Principles Database Systems (1994), 210–221. [20] W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci. 4 (1970), 177–192. [21] R. Szelepcsenyi, The method of forced enumeration for nondeterministic automata, Acta I...
متن کاملRestricted Two-Variable FO+MOD Sentences, Circuits and Communication Complexity
We obtain a logical characterization of an important class of regular languages, denoted DO, and of its most important subclasses in terms of two-variable sentences with ordinary and modular quantifiers but in which all modular quantifiers lie outside the scope of ordinary quantifiers. The result stems from a new decomposition of the variety of monoids DO in terms of iterated block products. Th...
متن کاملA New Low Complexity Parallel Multiplier for a Class of Finite Fields
In this paper a new low complexity parallel multiplier for characteristic two finite fields GF (2) is proposed. In particular our multiplier works with field elements represented through both Canonical Basis and Type I Optimal Normal Basis (ONB), provided that the irreducible polynomial generating the field is an All One Polynomial (AOP). The main advantage of the scheme is the resulting space ...
متن کاملDYN-MAC: A MAC Protocol for Cognitive Radio Networks with Dynamic Control Channel Assignment
Cognitive radio is one of the most promising wireless technologies and has been recognized as a new way to improve the spectral efficiency of wireless networks. In a cognitive radio network, secondary users exchange control information for network coordination such as transmitter-receiver handshakes, for sharing spectrum sensing results, for neighbor discovery, to maintain connectivity, and so ...
متن کاملLow-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2 m ) generated by an all-onepolynomial. The proposed canonical basis multiplier requires m 2 1 XOR gates and m 2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1520